Tolerant Testers of Image Properties

We initiate a systematic study of tolerant testers of image properties or, equivalently, algorithms that approximate the distance from a given image to the desired property (that is, the smallest fraction of pixels that need to change in the image to ensure that the image satisfies the desired property). Image processing is a particularly compelling area of applications for sublinear-time algorithms and, specifically, property testing. However, for testing algorithms to reach their full potential in image processing, they have to be tolerant, which allows them to be resilient to noise. Prior to this work, only one tolerant testing algorithm for an image property (image partitioning) has been published. We design efficient approximation algorithms for the following fundamental questions: What fraction of pixels have to be changed in an image so that it becomes a half-plane? a representation of a convex object? a representation of a connected object? More precisely, our algorithms approximate the distance to three basic properties (being a half-plane, convexity, and connectedness) within a small additive error , after reading a number of pixels polynomial in 1/ and independent of the size of the image. The running time of the testers for half-plane and convexity is also polynomial in 1/ . Tolerant testers for these three properties were not investigated previously. For convexity and connectedness, even the existence of distance approximation algorithms with query complexity independent of the input size is not implied by previous work. (It does not follow from the VC-dimension bounds, since VC dimension of convexity and connectedness, even in two dimensions, depends on the input size. It also does not follow from the existence of non-tolerant testers.) Our algorithms require very simple access to the input: uniform random samples for the halfplane property and convexity, and samples from uniformly random blocks for connectedness. However, the analysis of the algorithms, especially for convexity, requires many geometric and combinatorial insights. For example, in the analysis of the algorithm for convexity, we define a set of reference polygons P such that (1) every convex image has a nearby polygon in P and (2) one can use dynamic programming to quickly compute the smallest empirical distance to a polygon in P . This construction might be of independent interest. ∗A preliminary version of this article was published in the proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, ICALP, 2016 [3] †Pennsylvania State University, USA; [email protected]. ‡Pennsylvania State University, USA; [email protected]. This author was supported by NSF CAREER award CCF-0845701 and NSF award CCF-1422975. §Pennsylvania State University, USA; [email protected]. This author was supported by NSF CAREER award CCF-0845701, NSF award CCF-1422975, and by Boston University’s Hariri Institute for Computing and Center for Reliable Information Systems and Cyber Security and, while visiting the Harvard Center for Research on Computation & Society, by a Simons Investigator grant to Salil Vadhan.